An explicit formula for the inverse of band triangular Toeplitz matrix
نویسندگان
چکیده
منابع مشابه
An explicit formula for the inverse of band triangular Toeplitz matrix
In order to estimate the condition number of the preconditioned matrix proposed in [F.R. Lin, W.K. Ching, Inverse Toeplitz preconditioners for Hermitian Toeplitz systems, Numer. Linear Algebra Appl. 12 (2005) 221–229], we study the inverse of band triangular Toeplitz matrix. We derive an explicit formula for the entries of the inverse of band lower triangular Toeplitz matrix by means of divided...
متن کاملExplicit inverse of a tridiagonal k-Toeplitz matrix
We obtain explicit formulas for the entries of the inverse of a nonsingular and irreducible tridiagonal k−Toeplitz matrix A. The proof is based on results from the theory of orthogonal polynomials and it is shown that the entries of the inverse of such a matrix are given in terms of Chebyshev polynomials of the second kind. We also compute the characteristic polynomial of A which enable us to s...
متن کاملAn explicit formula for the matrix logarithm
We present an explicit polynomial formula for evaluating the principal logarithm of all matrices lying on the line segment {I(1 − t) + At : t ∈ [0, 1]} joining the identity matrix I (at t = 0) to any real matrix A (at t = 1) having no eigenvalues on the closed negative real axis. This extends to the matrix logarithm the well known Putzer’s method for evaluating the matrix exponential. Key-words...
متن کاملRecursive Algorithm for the Fundamental/Group Inverse Matrix of a Markov Chain from an Explicit Formula
We present a new accurate algorithm (REFUND) for computing the fundamental matrix (or closely related group inverse matrix) of a finite regular Markov chain. This algorithm is developed within the framework of the State Reduction approach exemplified by the GTH (Grassmann, Taksar, Heyman)/Sheskin algorithm for recursively finding invariant measure. The first (reduction) stage of the GTH/S algor...
متن کاملA note on computing the inverse of a triangular Toeplitz matrix
Using trigonometric polynomial interpolation, a fast and effective numerical algorithm for computing the inverse of a triangular Toeplitz matrix with real numbers has been recently proposed [Lin et al., Theor Comp Sci 315: 511–523, 2004]. The complexity of the algorithm is two fast Fourier transforms (FFTs) and one fast cosine transform (DCT) of 2n-vectors. In this paper, we present an algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.05.007